Preservation of Lipschitz constants by Bernstein type operators

Summary We obtain preservation inequalities for Lipschitz constants of higher order in simultaneous approximation processes by Bernstein type operators. From such inequalities we derive the preservation of the corresponding Lipschitz spaces.     

Controlling an oscillating Jackson-type network having state-dependent service rates

We consider a Jackson-type network comprised of two queues having state-dependent service rates, in which the queue lengths evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease the probability of a customers overflow in one of the queues in the network, the server in that same queue – contrary to intuition – should be shut down for a short period of time. Further noise reduction is obtained if the server in the second queue is briefly shut down as well, when certain conditions hold.     

On Best Approximations from RS-sets in Complex Banach Spaces

The concept of an RS-set in a complex Banach space is introduced and the problem of best approximation from an RS-set in a complex space is investigated. Results consisting of characterizations, uniqueness and strong uniqueness are established,     

一维粗糙表面散射特征的数值分析

使用Monte Carlo模拟的方法得出了随机粗糙表面，在Kirchhoff近似的基础上，利用数值分析的方法分析了一维随机粗糙表面的散射特征，得出了一维随机粗糙表面散射分布曲线，我们还考虑了遮蔽效应的影响，并且讨论了Kirchhoff近似的有效性。     

基因组重排问题的一个近似算法

分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题．基于断点图的概念，给出一个时间复杂性为O(max{b^(π)，nb(π)})，空间复杂性为0(n)的求其近似最优解的算法．其中n为基因组中基因个数，π=(π1,π2，…，πn)表示n个基因的一种排列，b(π)表示排列π中的断点数．数据实验的结果表明，该近似算法可以求得较好的结果．     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.     

矩阵方程AXB=D的最小二乘Hermite解及其加权最佳逼近

本中,我们讨论了矩阵方程AXB=D的最小二乘Hermite解,通过运用广义奇异值分解(GSVD)，获得了解的通式。此外,对于给定矩阵F，也得到了它的加权最佳逼近表达式。     

WEIGHTED APPROXIMATION ON SZASZ—TYPE OPERATORS

In this paper, we use weighted modules ω(?)(f,t)w to study the pointwise approximation on Szasz-type operators, and obtain the direct and converse theorem, as well as characterizations of the pointwise approximation of Jacobi-weighted Szasz-type operators.     

Blind Channel Identification Based on Noisy Observation by Stochastic Approximation Method

A stochastic approximation algorithm for estimating multichannel coefficients is proposed, and the estimate is proved to converge to the true parameters a.s. up-to a constant scaling factor. The estimate is updated after receiving each new observation, so the output data need not be collected in advance. The input signal is allowed to be dependent and the observation is allowed to be corrupted by noise, but no noise statistics are used in the estimation algorithm.     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.